Matching Problelll
نویسندگان
چکیده
In this short note we tie up some loose ends regarding the two-sample matching problem and its connections with the Monge-Kantorovich problem of optimal transportation of mass. By making this connection explicit, we immediately obtain moderate and large deviation principles.
منابع مشابه
Dependency Based Coordination for Consistent Solutions in Distributed Work
Many orga~lizat~ional problems can be decoinposed into nearly iildepeizdent subproblems the solution of which is the responsibility of independent agents. In this kind of work, which we call distributed work, the problems are only nearly independent since dependencies exist between the comlllitinents required from each agent. As a consequence of these dependencies, the coordination problelll be...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملOn the Inverse Problelll of Fractal COlllpression
The inverse problem of fractal compression amounts to determining a contractive operator such that the corresponding fixed point approximates a given target function. The standard method based on the collage coding strategy is known to represent a suboptimal method. Why does one not search for optimal fractal codes? We will prove that optimal fractal coding, when considered as a discrete optimi...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملAn Improved Semantic Schema Matching Approach
Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...
متن کامل